A general unified framework for interval pairwise comparison matrices
نویسندگان
چکیده
منابع مشابه
A general unified framework for interval pairwise comparison matrices
Interval Pairwise Comparison Matrices have been widely used to account for uncertain statements concerning the preferences of decision makers. Several approaches have been proposed in the literature, such as multiplicative and fuzzy interval matrices. In this paper, we propose a general unified approach to Interval Pairwise Comparison Matrices, based on Abelian linearly ordered groups. In this ...
متن کاملDeriving weights from general pairwise comparison matrices
The problem of deriving weights from pairwise comparison matrices has been treated extensively in the literature. Most of the results are devoted to the case when the matrix under consideration is reciprocally symmetric (i.e., the i, j-th element of the matrix is reciprocal to its j, i-th element for each i and j). However, there are some applications of the framework when the underlying matric...
متن کاملInterval Weighted Comparison Matrices – A Review
Nowadays, interval comparison matrices (ICM) take an important role in decision making under uncertainty. So it seems that a brief review on solution methods used in ICM should be useful. In this paper, the common methods are divided into four categories that are Goal Programming Method (GPM), Linear Programming Method (LPM), Non-Linear Programming Method (NLPM) and Statistic Analysis (SA). GPM...
متن کاملA method for approximating pairwise comparison matrices by consistent matrices
In several methods of multiattribute decision making, pairwise comparison matrices are applied to derive implicit weights for a given set of decision alternatives. A class of the approaches is based on the approximation of the pairwise comparison matrix by a consistent matrix. In the paper this approximation problem is considered in the least-squares sense. In general, the problem is nonconvex ...
متن کاملA Unified Framework for Interval Constraints and Interval Arithmetic
We are concerned with interval constraints: solving constraints among real unknowns in such a way that soundness is not aaected by rounding errors. The contraction operator for the constraint x + y = z can simply be expressed in terms of interval arithmetic. An attempt to use the analogous deenition for x y = z fails if the usual deenitions of interval arithmetic are used. We propose an alterna...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2018
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2017.11.002